Random Access

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neural Random-Access Machines

In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure input-output examples using backpropagation. We evaluate the new model on a number of simple algorithmic tasks whose solutions require pointer manipulation and...

متن کامل

Random Access Photonic Metamaterials

We demonstrate the first addressable reconfigurable photonic metamaterials thus enabling control over optical material properties with simultaneous spatial and temporal resolution. Potential applications of random access metadevices include active focusing, beam steering, dynamic transformation optics and video holography.

متن کامل

Holographic Random Access Memory

We examine the primary challenges for building a practical and competitive holographic random access memory (HRAM) system, specifically for size, speed, and cost. We show that a fast HRAM system can be implemented with a compact architecture by incorporating conjugate readout, a pixel-matched sensor array, and a linear array of laser diodes. It provides faster random access time than hard disk ...

متن کامل

Static Random Access Memories

Testing static random access memories (SRAM’s) for all possible failures is not feasible. We have to restrict the class of faults to he considered. This restricted class is called a fault model. A fault model for SRAM’s is presented based on physical spot defects, which are modeled as local disturbances in the layout of an SRAM. Two linear test algorithms are proposed, that cover 100% of the fa...

متن کامل

Simple Random Access Compression

Given a sequence S of n symbols over some alphabet Σ of size σ, we develop new compression methods that are (i) very simple to implement; (ii) provide O(1) time random access to any symbol (or short substring) of the original sequence. Our simplest solution uses at most 2h + o(h) bits of space, where h = n(H0(S) + 1), and H0(S) is the zeroth-order empirical entropy of S. We discuss a number of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Journal of General Practice

سال: 2017

ISSN: 0960-1643,1478-5242

DOI: 10.3399/bjgp17x691577